RIMS-1696 INTEGRAL SECTIONS OF SOME ELLIPTIC K3 SURFACE VIA THE BINARY GOLAY CODE By
نویسندگان
چکیده
We study the Mordell-Weil lattice E(K) of the elliptic K3 surface y = x + t − t in characteristic 11. We give an exact description of E(K) by using an embedding into a Niemeier lattice. Then we use the properties of the binary Golay code to enumerate the number of low length vectors. In particular we can compute the kissing number of this lattice (equivalently the number of integral sections) theoretically. We also answer a question posed by Dolgachev and Keum, showing that there are infinitely many wild automorphisms on the surface with an isolated fixed point.
منابع مشابه
An elliptic K3 surface associated to Heron triangles
A rational triangle is a triangle with rational sides and rational area. A Heron triangle is a triangle with integral sides and integral area. In this article we will show that there exist infinitely many rational parametrizations, in terms of s, of rational triangles with perimeter 2s(s + 1) and area s(s − 1). As a corollary, there exist arbitrarily many Heron triangles with all the same area ...
متن کاملA New Construction for the Extended Binary Golay Code
We give a new construction of the extended binary Golay code. The construction is carried out by taking the Gray image of a self-dual linear code over the ring R = F2+uF2+vF2+uvF2 of length 6 and size 212. Writing a typical generating matrix of the form [I3|A], with A being a 3× 3 matrix over R, and finding some dependencies among the entries of A, we are able to set a general form for the gene...
متن کاملA Feynman Integral via Higher Normal Functions
— We study the Feynman integral for the three-banana graph defined as the scalar two-point self-energy at three-loop order. The Feynman integral is evaluated for all identical internal masses in two space-time dimensions. Two calculations are given for the Feynman integral; one based on an interpretation of the integral as an inhomogeneous solution of a classical Picard-Fuchs differential equat...
متن کاملConstructing the Extended Binary Golay Code
Coding theory is the subject which is concerned with how information can be sent over a noisy channel. A code then is a collection of codewords which are strings of a fixed number of letters from an alphabet. Some of these strings are codewords others are not. When a codeword is sent over a channel there is a probability less than /2 that each letter in the codeword will be changed, thus introd...
متن کاملHigh-Speed Decoding of the Binary Golay Code
Recently, some table-lookup decoding algorithms (TLDAs) have been used to correct the binary Golay code. This paper proposes an efficient high-speed TLDA called message-syndrome decoding algorithm (MSDA) by using the message syndrome to correct the binary systematic Golay code. The proposed MSDA is based on the novel message-syndrome lookup table (MSLT). The MSLT merely consists of 12 candidate...
متن کامل